#define _CRT_SECURE_NO_WARNINGS 1

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
 /**
  * Definition for a binary tree node.
  * struct TreeNode {
  *     int val;
  *     TreeNode *left;
  *     TreeNode *right;
  *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
  *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
  *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
  * };
  */
class Solution {
public:
    bool Compare(ListNode* head, TreeNode* root)
    {
        if (head == nullptr) return true;
        if (root == nullptr || head->val != root->val) return false;
        return Compare(head->next, root->left) || Compare(head->next, root->right);
    }
    bool isSubPath(ListNode* head, TreeNode* root) {
        if (root == nullptr) return false;
        if (Compare(head, root)) return true;
        return isSubPath(head, root->left) || isSubPath(head, root->right);
    }
};